Distributed Resource Allocation Over Time-Varying Balanced Digraphs With Discrete-Time Communication

This work is concerned with the problem of distributed resource allocation in continuous-time setting but discrete-time communication over infinitely jointly connected and balanced digraphs. We provide a passivity-based perspective for algorithm, based on which an intermittent scheme developed. Particularly, periodic first derived through analyzing passivity degradation output sampling dynamics at each node. Then, asynchronous event-triggered further The sampled-based exempt from Zeno behavior as minimum interevent time lower bounded by period. parameters proposed algorithm rely only local information individual node, can be designed truly fashion.